Stream Automata Are Coalgebras
نویسندگان
چکیده
Stream automata (also called ω-automata) and ω-regular languages are of paramount importance in Computer Science and Logic. A coalgebraic treatment of these structures has not been given yet. We study a simple two-sorted setting where deterministic Muller automata can be cast as coalgebras, so that coalgebraic bisimilarity coincides with language equivalence. From this characterisation, we derive concise and natural decision procedures for complementation, union, intersection, and equivalence check.
منابع مشابه
Fixpoint Logics and Automata: A Coalgebraic Approach
A long and fertile tradition in theoretical computer science, going back to the work of Büchi and Rabin, links the field of (fixpoint) logic to that of automata theory. In particular, automata operating on potentially infinite structures such as streams, trees, graphs or transition systems, provide an invaluable tool for the specification and verification of the ongoing behavior of systems. An ...
متن کاملLifting Adjunctions to Coalgebras to (Re)Discover Automata Constructions
It is a well-known fact that a nondeterministic automaton can be transformed into an equivalent deterministic automaton via the powerset construction. From a categorical perspective this construction is the right adjoint to the inclusion functor from the category of deterministic automata to the category of nondeterministic automata. This is in fact an adjunction between two categories of coalg...
متن کاملA coalgebraic perspective on linear weighted automata
Article history: Received 23 March 2011 Revised 19 September 2011 Available online 30 December 2011 Weighted automata are a generalisation of non-deterministic automata where each transition, in addition to an input letter, has also a quantity expressing the weight (e.g. cost or probability) of its execution. As for non-deterministic automata, their behaviours can be expressed in terms of eithe...
متن کاملWell-Pointed Coalgebras (Extended Abstract)
For set functors preserving intersections, a new description of the final coalgebra and the initial algebra is presented: the former consists of all well-pointed coalgebras. These are the pointed coalgebras having no proper subobject and no proper quotient. And the initial algebra consists of all well-pointed coalgebras that are well-founded in the sense of Taylor [16]. Finally, the initial ite...
متن کاملWell-Pointed Coalgebras
For set functors preserving intersections, a new description of the final coalgebra and the initial algebra is presented: the former consists of all well-pointed coalgebras. These are the pointed coalgebras having no proper subobject and no proper quotient. And the initial algebra consists of all well-pointed coalgebras that are well-founded in the sense of Osius [20] and Taylor [27]. Finally, ...
متن کامل